Opinion Dynamics with Random Actions and a Stubborn Agent

We study opinion dynamics in a social network with stubborn agents who influence their neighbors but who themselves always stick to their initial opinion. We consider first the well-known DeGroot model. While it is known in the literature that this model can lead to consensus even in the presence of a stubborn agent, we show that the same result holds under weaker assumptions than has been previously reported. We then consider a recent extension of the DeGroot model in which the opinion of each agent is a random Bernoulli distributed variable, and by leveraging on the first result we establish that this model also leads to consensus, in the sense of convergence in probability, in the presence of a stubborn agent. Moreover, all agents' opinions converge to that of the stubborn agent.Comment: 5 pages; This work was presented at Asilomar Conference on Signals, Systems, and Computers 201

Some constructions of superimposed codes in Euclidean spaces

AbstractWe describe three new methods for obtaining superimposed codes in Euclidean spaces. With help of them we construct codes with parameters improving upon known constructions. We also prove that the spherical simplex code is not optimal as superimposed code at least for dimensions greater than 9

Accuracy Comparison of LS and Squared-Range LS for Source Localization

In this correspondence we compute a closed-form expression for theasymptotic (large-sample) accuracy of the recently proposedsquared-range least-squares (SR-LS) method for source localization. We compare its accuracy to that of the classicalleast-squares (LS) method and show that LS and SR-LS performdifferently in general. We identify geometries where theperformances of the methods are identical but also geometries when thedifference in performance is unbounded.©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Erik G. Larsson and Danyo Danev, Accuracy Comparison of LS and Squared-Range LS for Source Localization, 2010, IEEE Transactions on Signal Processing, (58), 2, 916-923.http://dx.doi.org/10.1109/TSP.2009.203203

A Family of Constacyclic Ternary Quasi-Perfect Codes with Covering Radius 3

In this paper a family of constacyclic ternary quasi-perfect linearblock codes is presented. This family extends the result presented ina previous work by the first two authors, where the existence of codeswith the presented parameters was stated as an open question. The codes have a minimum distance 5 and covering radius 3

A Geometria de Euclides a Lobatschewski: um estudo histórico-pedagógicop.247-251

BRITO, Arlete de Jesus. Natal: Editora da UFRN, 200